منابع مشابه
Efficient construction of broadcast graphs
A broadcast graph is a connected graph, G = (V,E), |V | = n, in which each vertex can complete broadcasting of one message within at most t = ⌈logn⌉ time units. A minimum broadcast graph on n vertices is a broadcast graph with the minimum number of edges over all broadcast graphs on n vertices. The cardinality of the edge set of such a graph is denoted by B(n). In this paper we construct a new ...
متن کاملEfficient Construction of 2K+ Graphs
I. INTRODUCTION Researchers often need to generate synthetic graphs with key properties resembling those of networks of interest. This is for example the case when the full topology is unavailable or impractical to measure or use. In our work, we are interested in generating graphs that resemble online social networks in terms of their joint degree distribution (JDM) and their degree-dependent ...
متن کاملEfficient Output-Sensitive Construction of Reeb Graphs
The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these cri...
متن کاملEfficient Construction of B -essential Graphs
Essential graphs and largest chain graphs are well-established graphical representations of equivalence classes of DAGs and chain graphs (CGs) respectively, especially useful in the context of structural learning. Recently, Roverato and La Rocca (2004) introduced the notion of a labelled block ordering of vertices B as a flexible tool for specifying subfamilies of CGs. In particular, both the f...
متن کاملSecure and Efficient Construction of Broadcast Encryption with Dealership
Broadcast encryption with dealership (BED) has been proposed to achieve more innovative and scalable business models for broadcast services. It has an extensive application future. However, designing secure BED is a challenging task. The only known BED construction so far is by Gritti et al. We aim to raise the profile of BED primitives which has not received much attention despite of its impor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.01.025